Explicit upper bounds for the remainder term in the divisor problem
نویسندگان
چکیده
We first report on computations made using the GP/PARI package that show that the error term Δ(x) in the divisor problem is = M (x, 4)+ O∗(0.35x1/4 log x) when x ranges [1 081 080, 1010], where M (x, 4) is a smooth approximation. The remaining part (and in fact most) of the paper is devoted to showing that |Δ(x)| ≤ 0.397x1/2 when x ≥ 5 560 and that |Δ(x)| ≤ 0.764x1/3 log x when x ≥ 9 995. Several other bounds are also proposed. We use this results to get an improved upper bound for the class number of a quadractic imaginary field and to get a better remainder term for averages of multiplicative functions that are close to the divisor function. We finally formulate a positivity conjecture concerning Δ(x).
منابع مشابه
Tight Upper Bounds on the Minimum Precision Required of the Divisor and the Partial Remainder in High-Radix Division
Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial remainder in redundant form and selecting the quotient digits in a radix higher than 2. Use of a redundant partial remainder replaces the standard addition in each cycle by a carry-free addition, thus making the cycles shorter. Deriving the quotient in high radix reduces the number of cycles (by a fa...
متن کاملRecent Progress on the Dirichlet Divisor Problem and the Mean Square of the Riemann Zeta-function
Let ∆(x) and E(t) denote respectively the remainder terms in the Dirichlet divisor problem and the mean square formula for the Riemann zeta-function on the critical line. This article is a survey of recent developments on the research of these famous error terms in number theory. These include upper bounds, Ω-results, sign changes, moments and distribution, etc. A few open problems will also be...
متن کاملEXPLICIT UPPER BOUNDS FOR THE AVERAGE ORDER OF dn(m) AND APPLICATION TO CLASS NUMBER
In this paper, we prove some explicit upper bounds for the average order of the generalized divisor function, and, according to an idea of Lenstra, we use them to obtain bounds for the class number of number fields.
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملOn the Riemann Zeta-function and the Divisor Problem Ii
Let ∆(x) denote the error term in the Dirichlet divisor problem, and E(T ) the error term in the asymptotic formula for the mean square of |ζ( 1 2 + it)|. If E∗(t) = E(t) − 2π∆∗(t/2π) with ∆∗(x) = −∆(x) + 2∆(2x) − 1 2 ∆(4x), then we obtain ∫ T 0 |E(t)| dt ≪ε T 2+ε and ∫ T 0 |E∗(t)| 544 75 dt ≪ε T 601 225 . It is also shown how bounds for moments of |E∗(t)| lead to bounds for moments of |ζ( 1 2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 81 شماره
صفحات -
تاریخ انتشار 2012